On the semilocal convergence of efficient Chebyshev-Secant-type methods
نویسندگان
چکیده
We introduce a three-step Chebyshev–Secant-type method (CSTM) with high efficiency index for solving nonlinear equations in a Banach space setting. We provide a semilocal convergence analysis for (CSTM)using recurrence relations. Numerical examples validating our theoretical results are also provided in this study. © 2011 Elsevier B.V. All rights reserved.
منابع مشابه
A Unified Convergence Analysis for Secant-type Methods
We present a unified local and semilocal convergence analysis for secant-type methods in order to approximate a locally unique solution of a nonlinear equation in a Banach space setting. Our analysis includes the computation of the bounds on the limit points of the majorizing sequences involved. Under the same computational cost our semilocal convergence criteria can be weaker; the error bounds...
متن کاملOn a Secant-like Method for Solving Generalized Equations
In the paper by Hilout and Piétrus (2006) a semilocal convergence analysis was given for the secant-like method to solve generalized equations using Hölder-type conditions introduced by the first author (for nonlinear equations). Here, we show that this convergence analysis can be refined under weaker hypothesis, and less computational cost. Moreover finer error estimates on the distances invol...
متن کاملLocal Convergence of the Secant Method Upper Hölder Continuous Divided Differences
The semilocal convergence of the secant method under Hölder continuous divided differences in a Banach space setting for solving nonlinear equations has been examined by us in [3]. The local convergence was recently examined in [4]. Motivated by optimization considerations and using the same hypotheses but more precise estimates than in [4] we provide a local convergence analysis with the follo...
متن کاملModified frame algorithm and its convergence acceleration by Chebyshev method
The aim of this paper is to improve the convergence rate of frame algorithm based on Richardson iteration and Chebyshev methods. Based on Richardson iteration method, we first square the existing convergence rate of frame algorithm which in turn the number of iterations would be bisected and increased speed of convergence is achieved. Afterward, by using Chebyshev polynomials, we improve this s...
متن کاملTwo Settings of the Dai-Liao Parameter Based on Modified Secant Equations
Following the setting of the Dai-Liao (DL) parameter in conjugate gradient (CG) methods, we introduce two new parameters based on the modified secant equation proposed by Li et al. (Comput. Optim. Appl. 202:523-539, 2007) with two approaches, which use an extended new conjugacy condition. The first is based on a modified descent three-term search direction, as the descent Hest...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Computational Applied Mathematics
دوره 235 شماره
صفحات -
تاریخ انتشار 2011